Scalable Garbage Collection with Guaranteed MMU
نویسندگان
چکیده
Regional garbage collection offers a useful compromise between real-time and generational collection. Regional collectors resemble generational collectors, but are scalable: our main theorem guarantees a positive lower bound, independent of mutator and live storage, for the theoretical worst-case minimum mutator utilization (MMU). The theorem also establishes upper bounds for worst-case space usage and collection pauses. Standard generational collectors are not scalable. Some realtime collectors are scalable, while others assume a well-behaved mutator or provide no worst-case guarantees at all. Regional collectors cannot compete with hard real-time collectors at millisecond resolutions, but offer efficiency comparable to contemporary generational collectors combined with improved latency and MMU at resolutions on the order of hundreds of milliseconds to a few seconds.
منابع مشابه
Partitioned Garbage Collection of a Large Object Store
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. The heap is divided into partitions that are collected independently using information about inter-partition references. We present efficient techniques to maintain this information stably using auxiliary data structures in memory and the log. The result ...
متن کاملGarbage Collection for Hard Real-Time Systems
This paper describes a scheme for garbage collection suitable for hard real-time applications. The approach supports both periodic high-priority processes and low-priority processes. Garbage collection work is done exclusively during execution of low-priority processes. A prototype garbage collector has been implemented for a C++ real-time kernel. The results confirms that high-priority process...
متن کاملGarbage Collection for Control Systems
This paper describes a scheme for garbage collection suitable for hard real-time applications. The approach supports both periodic high-priority processes and low-priority processes. Garbage collection work is done exclusively during execution of low-priority processes. A prototype garbage collector has been implemented for a C++ real-time kernel. The results confirms that high-priority process...
متن کاملPractical Distributed Garbage Collection for Networks with Synchronous Clocks and Message Delay
Distributed garbage collection over a message passage network i s discussed in this paper. Traditionally, this can be done b y reference counting, which is fast but cannot reclaim cyclic structures or b y graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage an...
متن کامل